NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES

Nondeterministic Descriptional Complexity Of Regular Languages

On the descriptional and algorithmic complexity of regular languages

Gedruckt auf alterungsbeständigem Papier nach ISO 9706 (säure-, holz-und chlorfrei). Digital ist besser Tocotronic vi Preface This thesis is a research monograph. As such, it targets at an audience of experts, primarily in the fields of foundations of computer science and discrete mathematics. Nevertheless, already several persons showed interest in understanding at least the main theme of this...

Nondeterministic Biautomata and Their Descriptional Complexity

Biautomata were recently introduced in [4] as a generalization of ordinary deterministic finite automata. A biautomaton consists of a deterministic finite control, a read-only input tape, and two reading heads, one reading the input from left to right, and the other head reading the input from right to left. An input word is accepted by a biautomaton, if there is an accepting computation starti...

Nondeterministic State Complexity for Suffix-Free Regular Languages

We investigate the nondeterministic state complexity of basic operations for suffix-free regular languages. The nondeterministic state complexity of an operation is the number of states that are necessary and sufficient in the worst-case for a minimal nondeterministic finite-state automaton that accepts the language obtained from the operation. We consider basic operations (catenation, union, i...

Descriptional complexity measures of context-free languages

In [2], [3] and [4] several measures of descriptional complexity of context-free grammars (cfg's) and context-free languages (cfl's) have been investigated, most of them having the following properties: 1. The corresponding hierarchy of complexity classes of languages over two-letter alphabets is infinite. 2. The basic algorithmic problems are undecidable. (For example, the problems to determin...